منابع مشابه
WORM colorings
Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F , we define an F -WORM coloring of G as a coloring of the vertices of G without a rainbow or monochromatic subgraph H isomorphic to F . We present some results on this concept espe...
متن کاملWORM colorings Forbidding Cycles or Cliques
Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a forbidden graph F , we define an F -WORM coloring of G as a coloring of the vertices if G without a rainbow or monochromatic subgraph isomorphic to F . We explore such colorings especially...
متن کاملPerfect $2$-colorings of the Platonic graphs
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
متن کاملPatch Colorings and Rigid Colorings of the Rational n-Space
We investigate k-colorings of the rational n-space, Q, such that any two points at distance one get distinct colors. Two types of colorings are considered: patch colorings where the colors occupy open sets with parts of their boundary, and rigid colorings which uniquely extend from any open subset of Q. We prove that the existence of a patch k-coloring of Q implies the existence of a k-coloring...
متن کاملAnalytic colorings
We investigate the existence of perfect homogeneous sets for analytic colorings. An analytic coloring of X is an analytic subset of [X] , where N > 1 is a natural number. We define an absolute rank function on trees representing analytic colorings, which gives an upper bound for possible cardinalities of homogeneous sets and which decides whether there exists a perfect homogeneous set. We const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2015
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1814